On some graph densities in locally dense graphs
نویسندگان
چکیده
منابع مشابه
On some covering graphs of a graph
For a graph G with vertex set V (G) = {v1, v2, . . . , vn}, let S be the covering set of G having the maximum degree over all the minimum covering sets of G. Let NS[v] = {u ∈ S : uv ∈ E(G)} ∪ {v} be the closed neighbourhood of the vertex v with respect to S. We define a square matrix AS(G) = (aij), by aij = 1, if |NS[vi] ∩NS[vj]| ≥ 1, i 6= j and 0, otherwise. The graph G associated with the mat...
متن کاملOperations on Graphs Increasing Some Graph Parameters
In this partly expository paper we discuss and describe some of our old and recent results on partial orders on the set G n of graphs with n vertices and m edges and some operations on graphs within G n that are monotone with respect to these partial orders. The partial orders under consideration include those related with some Laplacian characteristics of graphs as well as with some probabilis...
متن کاملThe Nonlinear Heat Equation on Dense Graphs and Graph Limits
The continuum limit of coupled dynamical systems is an approximate procedure, by which the dynamical problem on a sequence of large graphs is replaced by an evolution integral equation on a continuous spatial domain. While this method has been widely used in the analysis of pattern formation in nonlocally coupled networks, its mathematical basis remained little understood. In this paper, we use...
متن کاملApplications of some Graph Operations in Computing some Invariants of Chemical Graphs
In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.
متن کاملChromaticity of some families of dense graphs
For a graph G, let P(G; ) be its chromatic polynomial and let [G] be the set of graphs having P(G; ) as their chromatic polynomial. We call [G] the chromatic equivalence class of G. If [G]={G}, then G is said to be chromatically unique. In this paper, we 4rst determine [G] for each graph G whose complement 5 G is of the form aK1∪bK3∪⋃16i6s Pli , where a; b are any nonnegative integers and li is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2020
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20974